Defining quantumness via the Jordan product
نویسندگان
چکیده
منابع مشابه
On strongly Jordan zero-product preserving maps
In this paper, we give a characterization of strongly Jordan zero-product preserving maps on normed algebras as a generalization of Jordan zero-product preserving maps. In this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly Jordan zero-product preserving maps are completely different. Also, we prove that the direct p...
متن کاملDefining product architectures
Identifying product architectures is recognized as a critical activity during the preliminary design phase since the selected architecture has a great impact on the product quality, on the organization of the following phases of the design project and on the global performance of this project. System architects need methods to pre-determine cohesive modules and integrative elements. In this pap...
متن کاملon strongly jordan zero-product preserving maps
in this paper, we give a characterization of strongly jordan zero-product preserving maps on normed algebras as a generalization of jordan zero-product preserving maps. in this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly jordan zero-product preserving maps are completely different. also, we prove that the direct p...
متن کاملJordan product determined points in matrix algebras
Let Mn(R) be the algebra of all n×n matrices over a unital commutative ring R with 6 invertible. We say that A ∈ Mn(R) is a Jordan product determined point if for every R-module X and every symmetric R-bilinear map {·, ·} : Mn(R)×Mn(R) → X the following two conditions are equivalent: (i) there exists a fixed element w ∈ X such that {x, y} = w whenever x ◦ y = A, x, y ∈ Mn(R); (ii) there exists ...
متن کاملPutting “Quantumness” to the Test
What is a quantum computer? We could say it’s a machine that calculates solutions to problems using quantum components. But this definition is incomplete; after all, an abacus is made of quantum elements (atoms) and can do arithmetic. Rather, when physicists envision a quantum computer that, for example, factors large numbers in the blink of an eye, they are imagining a machine whose inner work...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2013
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/47/3/035301